NeuReach: Learning Reachability Functions from Simulations
نویسندگان
چکیده
Abstract We present , a tool that uses neural networks for predicting reachable sets from executions of dynamical system. Unlike existing reachability tools, computes function outputs an accurate over-approximation the set any initial in parameterized family. Such functions are useful online monitoring, verification, and safe planning. implements empirical risk minimization learning functions. discuss design rationale behind optimization problem establish computed output is probably approximately correct. Our experimental evaluations over variety systems show promise. can learn complex nonlinear systems, including some beyond methods. From learned function, arbitrary reachtubes be milliseconds. available at https://github.com/sundw2014/NeuReach .
منابع مشابه
Learning functions from examples
This paper concerns algorithms that "learn functions from examples. Functions on strings of a finite alphabet are considered and the notion of dimensionality defined for families of such functions. Using this notion, a theorem is proved identifying the most general conditions under which a family of functions can be efficiently learned from examples. Turning to some familiar families: we presen...
متن کاملDecision functions from supervised machine learning algorithms as collective variables for accelerating molecular simulations
Selection of appropriate collective variables for enhancing molecular simulations remains an unsolved problem in computational biophysics. In particular, picking initial collective variables (CVs) is particularly challenging in higher dimensions. Which atomic coordinates or transforms there of from a list of thousands should one pick for enhanced sampling runs? How does a modeler even begin to ...
متن کاملLearning recursive functions from approximations
This article investigates algorithmic learning, in the limit, of correct programs for recursive functions f from both input output examples of f and several interesting varieties of approximate additional (algorithmic) information about f. Specifically considered, as such approximate additional information about f, are Rose's frequency computations for f and several natural generalizations from...
متن کاملCompositional transient reachability analysis for agent-based simulations
Even though agent-based simulations have been applied successfully to various realworld projects, there is still much reluctance to accept them to the same degree as more traditional, equation-based techniques. Their inherent complexity due to nonlinear dynamics, a high level of heterogeneity and a vast parameter and state space are just some of the properties that make them difficult to unders...
متن کاملLanguage-Constraint Reachability Learning in Probabilistic Graphs
The probabilistic graphs framework models the uncertainty inherent in realworld domains by means of probabilistic edges whose value quantifies the likelihood of the edge existence or the strength of the link it represents. The goal of this paper is to provide a learning method to compute the most likely relationship between two nodes in a framework based on probabilistic graphs. In particular, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-99524-9_17